Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/D7Mvm
Repositorysid.inpe.br/banon/2004/08.10.18.20
Last Update2004:08.10.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2004/08.10.18.20.22
Metadata Last Update2022:06.14.00.12.39 (UTC) administrator
DOI10.1109/SIBGRA.2004.1352953
Citation KeyAudigierLotuFalc:2004:InItSe
TitleOn integrating iterative segmentation by watershed with tridimensional visualization of MRIs
FormatOn-line
Year2004
Access Date2024, May 02
Number of Files1
Size602 KiB
2. Context
Author1 Audigier, Romaric Matthias Michel
2 Lotufo, Roberto de Alencar
3 Falcão, Alexandre Xavier
Affiliation1 FEEC UNICAMP
2 FEEC UNICAMP
3 IC UNICAMP
EditorAraújo, Arnaldo de Albuquerque
Comba, João Luiz Dihl
Navazo, Isabel
Sousa, Antônio Augusto de
e-Mail Addressaudigier@dca.fee.unicamp.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
Conference LocationCuritiba, PR, Brazil
Date17-20 Oct. 2004
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-07-17 14:10:56 :: audigier -> banon ::
2008-08-26 15:15:43 :: banon -> administrator ::
2009-08-13 20:37:30 :: administrator -> banon ::
2010-08-28 20:01:14 :: banon -> administrator ::
2022-06-14 00:12:39 :: administrator -> :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsiterative segmentation
watershed
IFT
tridimensional visualization
MRI
AbstractThis work presents two fast and iterative methods that integrate segmentation by watershed and three-dimensional visualization, while the classical approach is to separate these two processes. The user-aided segmentation is based on iterative watershed, efficiently implemented using the Image Foresting Transform (IFT). The first proposed algorithm consists of extracting segmented structures' borders during the segmentation and updating them at each iteration. Structure visualization is achieved by border projection. The second algorithm updates the image directly from the changes of the segmented scene occured in each step. The two methods were implemented in C and tested with various Magnetic Resonance Images. The results are satisfactory as compared to the classical approaches. The incremental image algorithm is a little faster than the classical one while the incremental border algorithm, although a little slower in segmenting, allows a very fast rendering, very suitable for object manipulation. Thus, the proposed methods provide a good feedback to user.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2004 > On integrating iterative...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > On integrating iterative...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/D7Mvm
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/D7Mvm
Languageen
Target File4475_audigier_r.ps
User Groupaudigier
administrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46QM2BE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.03.00.29 11
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close